Degrees and degree sequence of k-edge d-critical graphs

Title: Degrees and degree sequence of k-edge d-critical graphs
Creator: Arumugam, S.; Martin, Latha
Relation: Journal of Discrete Mathematical Sciences and Cryptography Vol. 14, Issue 5, p. 421-429
Relation: http://www.tarupublications.com/jdmsc.html
Publisher: Taru Publications
Resource Type: journal article
Date: 2011
Description: Let k and d be positive integers with k ≥ 2d. Let Z_k = {0, 1, 2, …, k – 1} be the set of integers modulo k. Let D_k(x,y) = min{|x – y|,k – |x – y|} for x,y ∈ Z_k. A pseudo complete d-coloring of G using k colors is a mapping ϕ : V(G) → Z_k such that for any two elements i, j ∈ Z_k with D_k (i,j) ≥ d, there exist adjacent vertices u, v such that ϕ(u) = i and ϕ(v) = j. The maximum value of k for which G is k-pseudo complete d-colorable is called the pseudo d-achromatic number of G and is denoted by ψ^d_s(G). A graph G is called k-edge d-critical if ψ^d_s(G) = k and ψ^d_s(G - e) < k for all e ∈ E(G). In this paper we present several basic results on the degrees and degree sequence of k-edge d-critical graphs.
Subject: star chromatic number; pseudo complete d coloring; Pseudo d achromatic number; k edge d critical graph
Identifier: http://hdl.handle.net/1959.13/1037607
Identifier: uon:13453
Identifier: ISSN:0972-0529
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format